/*
 * Saphre - Suffix Arrays for Phrase Extraction
 * Copyright (C) 2013 
 * Dale Gerdemann - Tübingen, Germany 
 * Niko Schenk - Frankfurt am Main, Germany
 * All rights reserved.
 *
 * This program is free software: you can redistribute it and/or modify it under
 * the terms of the GNU General Public License as published by the Free Software
 * Foundation, either version 3 of the License, or (at your option) any later
 * version.
 *
 * This program is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
 * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
 * details.
 *
 * You should have received a copy of the GNU General Public License along with
 * this program. If not, see <http://www.gnu.org/licenses/>.
 *
 */
package util.tokenization_io;

import java.util.regex.Matcher;

public class TokenIterator {

    Matcher m;
    String nextTok;
    Normalizer norm;

    TokenIterator(Matcher m, Normalizer norm) {
        this.m = m;
        this.norm = norm;
        if (m.find()) {
            String s = m.group();
            String newTok = norm.normalize(s);
            nextTok = newTok;
        } else {
            nextTok = null;
        }
    }

    public boolean hasNext() {
        return nextTok != null;
    }

    public int start() {
        try {
            return m.start();
        } catch (Exception e) {
            return -1;

        }
    }

    public String next() {
        String result = nextTok;
        if (m.find()) {
            String s = m.group();
            String newTok = norm.normalize(s);
            nextTok = newTok;
        } else {
            nextTok = null;
        }
        return result;
    }

    public void remove() {
        throw new UnsupportedOperationException();
    }
}
